A Modified Recursive Regularization Factor Calculation for Sparse RLS Algorithm with l1-Norm

In this paper, we propose a new calculation method for the regularization factor in sparse recursive least squares (SRLS) with l1-norm penalty. The proposed requires no prior knowledge of actual system impulse response, and it also reduces computational complexity by about half. simulation, use Mean Square Deviation (MSD) to evaluate performance SRLS, using factor. simulation results demonstrate that SRLS shows difference less than 2 dB MSD from conventional true response. Therefore, is confirmed very similar existing method, even half complexity.